package 二分查找;

public class 稀疏矩阵搜索 {

    public static int findString(String[] words, String s) {
        for (int i = 0; i < words.length; i++) {
            if (words[i].equals(s))
                return i;
        }
        return -1;
    }
}
